TSTP Solution File: SWW971^5 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWW971^5 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep  1 00:22:48 EDT 2023

% Result   : CounterSatisfiable 30.62s 30.88s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWW971^5 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.13  % Command    : do_cvc5 %s %d
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun Aug 27 17:36:59 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.19/0.47  %----Proving TH0
% 0.19/0.48  %------------------------------------------------------------------------------
% 0.19/0.48  % File     : SWW971^5 : TPTP v8.1.2. Released v8.1.0.
% 0.19/0.48  % Domain   : Software Verification
% 0.19/0.48  % Problem  : Conflict detection of 2 conceptual schemata (e.g. UML-schemata)
% 0.19/0.48  % Version  : [BP13] axioms.
% 0.19/0.48  % English  : 
% 0.19/0.48  
% 0.19/0.48  % Refs     : [BE04]  Boeva & Ekenberg (2004), A Transition Logic for Schema
% 0.19/0.48  %          : [RO12]  Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.19/0.48  %          : [BP13]  Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.19/0.48  %          : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.19/0.48  % Source   : [TPTP]
% 0.19/0.48  % Names    : APM002+1 [QMLTP]
% 0.19/0.48  
% 0.19/0.48  % Status   : CounterCounterSatisfiable
% 0.19/0.48  % Rating   : 0.50 v8.1.0
% 0.19/0.48  % Syntax   : Number of formulae    :   34 (  11 unt;  18 typ;  10 def)
% 0.19/0.48  %            Number of atoms       :   74 (  10 equ;   0 cnn)
% 0.19/0.48  %            Maximal formula atoms :   24 (   4 avg)
% 0.19/0.48  %            Number of connectives :   99 (   1   ~;   1   |;   3   &;  90   @)
% 0.19/0.48  %                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
% 0.19/0.48  %            Maximal formula depth :   11 (   3 avg)
% 0.19/0.48  %            Number of types       :    3 (   1 usr)
% 0.19/0.48  %            Number of type conns  :   61 (  61   >;   0   *;   0   +;   0  <<)
% 0.19/0.48  %            Number of symbols     :   19 (  17 usr;   5 con; 0-3 aty)
% 0.19/0.48  %            Number of variables   :   33 (  25   ^;   6   !;   2   ?;  33   :)
% 0.19/0.48  % SPC      : TH0_CSA_EQU_NAR
% 0.19/0.48  
% 0.19/0.48  % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.19/0.48  %            version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.19/0.48  %            'modal' embedding, version 1.5.2. Logic specification used:
% 0.19/0.48  %            $modal == [$constants == $rigid,$quantification == $constant,
% 0.19/0.48  %            $modalities == $modal_system_S5].
% 0.19/0.48  %------------------------------------------------------------------------------
% 0.19/0.48  thf(mworld,type,
% 0.19/0.48      mworld: $tType ).
% 0.19/0.48  
% 0.19/0.48  thf(mrel_type,type,
% 0.19/0.48      mrel: mworld > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mactual_type,type,
% 0.19/0.48      mactual: mworld ).
% 0.19/0.48  
% 0.19/0.48  thf(mlocal_type,type,
% 0.19/0.48      mlocal: ( mworld > $o ) > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mlocal_def,definition,
% 0.19/0.48      ( mlocal
% 0.19/0.48      = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mnot_type,type,
% 0.19/0.48      mnot: ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mand_type,type,
% 0.19/0.48      mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mor_type,type,
% 0.19/0.48      mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mimplies_type,type,
% 0.19/0.48      mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mequiv_type,type,
% 0.19/0.48      mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mnot_def,definition,
% 0.19/0.48      ( mnot
% 0.19/0.48      = ( ^ [A: mworld > $o,W: mworld] :
% 0.19/0.48            ~ ( A @ W ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mand_def,definition,
% 0.19/0.48      ( mand
% 0.19/0.48      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.19/0.48            ( ( A @ W )
% 0.19/0.48            & ( B @ W ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mor_def,definition,
% 0.19/0.48      ( mor
% 0.19/0.48      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.19/0.48            ( ( A @ W )
% 0.19/0.48            | ( B @ W ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mimplies_def,definition,
% 0.19/0.48      ( mimplies
% 0.19/0.48      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.19/0.48            ( ( A @ W )
% 0.19/0.48           => ( B @ W ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mequiv_def,definition,
% 0.19/0.48      ( mequiv
% 0.19/0.48      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.19/0.48            ( ( A @ W )
% 0.19/0.48          <=> ( B @ W ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mbox_type,type,
% 0.19/0.48      mbox: ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mbox_def,definition,
% 0.19/0.48      ( mbox
% 0.19/0.48      = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.19/0.48          ! [V: mworld] :
% 0.19/0.48            ( ( mrel @ W @ V )
% 0.19/0.48           => ( Phi @ V ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mdia_type,type,
% 0.19/0.48      mdia: ( mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mdia_def,definition,
% 0.19/0.48      ( mdia
% 0.19/0.48      = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.19/0.48          ? [V: mworld] :
% 0.19/0.48            ( ( mrel @ W @ V )
% 0.19/0.48            & ( Phi @ V ) ) ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mrel_reflexive,axiom,
% 0.19/0.48      ! [W: mworld] : ( mrel @ W @ W ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mrel_euclidean,axiom,
% 0.19/0.48      ! [W: mworld,V: mworld,U: mworld] :
% 0.19/0.48        ( ( ( mrel @ W @ U )
% 0.19/0.48          & ( mrel @ W @ V ) )
% 0.19/0.48       => ( mrel @ U @ V ) ) ).
% 0.19/0.48  
% 0.19/0.48  thf(mforall_di_type,type,
% 0.19/0.48      mforall_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.19/0.48  
% 0.19/0.48  thf(mforall_di_def,definition,
% 0.19/0.48      ( mforall_di
% 0.19/0.48      = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.19/0.48          ! [X: $i] : ( A @ X @ W ) ) ) ).
% 0.19/0.49  
% 0.19/0.49  thf(mexists_di_type,type,
% 0.19/0.49      mexists_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.19/0.49  
% 0.19/0.49  thf(mexists_di_def,definition,
% 0.19/0.49      ( mexists_di
% 0.19/0.49      = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.19/0.49          ? [X: $i] : ( A @ X @ W ) ) ) ).
% 0.19/0.49  
% 0.19/0.49  thf(a_decl,type,
% 0.19/0.49      a: $i ).
% 0.19/0.49  
% 0.19/0.49  thf(b_decl,type,
% 0.19/0.49      b: $i ).
% 0.19/0.49  
% 0.19/0.49  thf(c_decl,type,
% 0.19/0.49      c: $i ).
% 0.19/0.49  
% 0.19/0.49  thf(p_decl,type,
% 0.19/0.49      p: $i > mworld > $o ).
% 0.19/0.49  
% 0.19/0.49  thf(r_decl,type,
% 0.19/0.49      r: $i > mworld > $o ).
% 0.19/0.49  
% 0.19/0.49  thf(schema1,axiom,
% 0.19/0.49      mlocal @ ( mand @ ( mor @ ( mnot @ ( r @ a ) ) @ ( r @ b ) ) @ ( mand @ ( mequiv @ ( r @ c ) @ ( r @ a ) ) @ ( mand @ ( mimplies @ ( r @ a ) @ ( mdia @ ( r @ b ) ) ) @ ( mimplies @ ( mnot @ ( r @ a ) ) @ ( mdia @ ( mand @ ( mnot @ ( r @ b ) ) @ ( mnot @ ( r @ c ) ) ) ) ) ) ) ) ).
% 0.19/0.49  
% 0.19/0.49  thf(schema2,axiom,
% 0.19/0.49      mlocal @ ( mand @ ( mimplies @ ( p @ a ) @ ( p @ b ) ) @ ( mand @ ( mor @ ( p @ c ) @ ( mnot @ ( p @ b ) ) ) @ ( mimplies @ ( mand @ ( p @ a ) @ ( p @ b ) ) @ ( mdia @ ( mnot @ ( p @ b ) ) ) ) ) ) ).
% 0.19/0.49  
% 0.19/0.49  thf(integration_assertion,axiom,
% 0.19/0.49      ( mlocal
% 0.19/0.49      @ ( mforall_di
% 0.19/0.49        @ ^ [X: $i] : ( mequiv @ ( p @ X ) @ ( r @ X ) ) ) ) ).
% 0.19/0.49  
% 0.19/0.49  thf(con,conjecture,
% 0.19/0.49      ( mlocal
% 0.19/0.49      @ ^ [W: mworld] : $false ) ).
% 0.19/0.49  
% 0.19/0.49  %------------------------------------------------------------------------------
% 0.19/0.49  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.IgfsgoUQWv/cvc5---1.0.5_13376.p...
% 0.19/0.49  (declare-sort $$unsorted 0)
% 0.19/0.49  (declare-sort tptp.mworld 0)
% 0.19/0.49  (declare-fun tptp.mrel (tptp.mworld tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.mactual () tptp.mworld)
% 0.19/0.49  (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.19/0.49  (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.19/0.49  (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.19/0.49  (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.19/0.49  (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.19/0.49  (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.19/0.49  (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.19/0.49  (declare-fun tptp.mbox ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (assert (= tptp.mbox (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.19/0.49  (declare-fun tptp.mdia ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (assert (= tptp.mdia (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.19/0.49  (assert (forall ((W tptp.mworld)) (@ (@ tptp.mrel W) W)))
% 0.19/0.49  (assert (forall ((W tptp.mworld) (V tptp.mworld) (U tptp.mworld)) (let ((_let_1 (@ tptp.mrel W))) (=> (and (@ _let_1 U) (@ _let_1 V)) (@ (@ tptp.mrel U) V)))))
% 0.19/0.49  (declare-fun tptp.mforall_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (assert (= tptp.mforall_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (forall ((X $$unsorted)) (@ (@ A X) W)))))
% 0.19/0.49  (declare-fun tptp.mexists_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.19/0.49  (assert (= tptp.mexists_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (exists ((X $$unsorted)) (@ (@ A X) W)))))
% 0.19/0.49  (declare-fun tptp.a () $$unsorted)
% 0.19/0.49  (declare-fun tptp.b () $$unsorted)
% 0.19/0.49  (declare-fun tptp.c () $$unsorted)
% 0.19/0.49  (declare-fun tptp.p ($$unsorted tptp.mworld) Bool)
% 0.19/0.49  (declare-fun tptp.r ($$unsorted tptp.mworld) Bool)
% 0.19/0.49  (assert (let ((_let_1 (@ tptp.r tptp.c))) (let ((_let_2 (@ tptp.r tptp.b))) (let ((_let_3 (@ tptp.r tptp.a))) (let ((_let_4 (@ tptp.mnot _let_3))) (@ tptp.mlocal (@ (@ tptp.mand (@ (@ tptp.mor _let_4) _let_2)) (@ (@ tptp.mand (@ (@ tptp.mequiv _let_1) _let_3)) (@ (@ tptp.mand (@ (@ tptp.mimplies _let_3) (@ tptp.mdia _let_2))) (@ (@ tptp.mimplies _let_4) (@ tptp.mdia (@ (@ tptp.mand (@ tptp.mnot _let_2)) (@ tptp.mnot _let_1)))))))))))))
% 30.62/30.88  (assert (let ((_let_1 (@ tptp.p tptp.b))) (let ((_let_2 (@ tptp.mnot _let_1))) (let ((_let_3 (@ tptp.p tptp.a))) (@ tptp.mlocal (@ (@ tptp.mand (@ (@ tptp.mimplies _let_3) _let_1)) (@ (@ tptp.mand (@ (@ tptp.mor (@ tptp.p tptp.c)) _let_2)) (@ (@ tptp.mimplies (@ (@ tptp.mand _let_3) _let_1)) (@ tptp.mdia _let_2)))))))))
% 30.62/30.88  (assert (@ tptp.mlocal (@ tptp.mforall_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.mequiv (@ tptp.p X)) (@ tptp.r X)) __flatten_var_0)))))
% 30.62/30.88  (assert (not (@ tptp.mlocal (lambda ((W tptp.mworld)) false))))
% 30.62/30.88  (set-info :filename cvc5---1.0.5_13376)
% 30.62/30.88  (check-sat-assuming ( true ))
% 30.62/30.88  ------- get file name : TPTP file name is SWW971^5
% 30.62/30.88  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_13376.smt2...
% 30.62/30.88  --- Run --ho-elim --full-saturate-quant at 10...
% 30.62/30.88  --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 30.62/30.88  --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 30.62/30.88  --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 30.62/30.88  % SZS status CounterSatisfiable for SWW971^5
% 30.62/30.88  % cvc5---1.0.5 exiting
% 30.62/30.88  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------